Pii: S0166-5316(98)00037-6
نویسندگان
چکیده
In this paper we present a control-theoretic approach to design stable rate-based flow control for ATM ABR services. The flow control algorithm that we consider has the most simple form among all the queue-length-based flow control algorithms, and is referred to as first-order rate-based flow control (FRFC) since the corresponding closed loop can be modeled as a first-order retarded differential equation. We analyze the equilibrium and the asymptotic stability of the closed loop for the case of multiple connections with diverse round-trip delays. We also characterize the asymptotic decay rate at which the stable closed loop tends to the equilibrium. The decay rate is shown to be a concave function of control gain with its maximum being the inverse of round-trip delay. We also consider an open loop control in which the queue control threshold is dynamically adjusted according to the changes in the available bandwidth and the number of connections. This open loop control is shown to be necessary and effective to prevent the closed loop from converging to an undesirable equilibrium point. c ©1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Designing Stable ABR Flow Control with Rate Feedback and Open Loop Control: First-Order Control Case
In this paper we present a control-theoretic approach to design stable rate-based Bow control for ATM ABR services. The flow control algorithm that we consider has the most simple form among all the queuelength-based flow control algorithms, and is referred to as Farst-order Rate-based Flow Control (FRFC) since the corresponding closed loop can be modeled as a firstorder retarded differential e...
متن کاملCongestion Detection in ATM Networks
Many systems in ATM environments require the queue to be monitored for impending congestion before it happens. In this paper, we characterize impending congestion by measuring how long the queue length has exceeded a certain threshold. We present a new performance measure called the conditional overrow probability which gives a quantitative measure on the congestion state. We develop a matrix a...
متن کاملEfficient Optimal Equation Formulation in Lumped Power-conserving Systems
Sets of inputs and outputs are defined for lumped power-conserving systems, and a set of inputs is defined to be consistent if the corresponding set of outputs can be written in terms of it. To find a set of state equations, dne needs a consistent set of inputs. Given one consistent set of inputs it is shown (1) how to test whether any other set of inputs is consistent, and (2) given a preferen...
متن کاملFine grained software degradation models for optimal rejuvenation policies
In this paper we address the problem of preventive maintenance of operational software systems, an approach recently proposed to counteract the phenomenon of software \aging". We consider the so-called \software rejuvenation" technique 13], which consists in periodically stopping the software system and then restarting it in a \robust" state after a proper maintenance, and we propose a methodol...
متن کاملTight Steady-State Availability Bounds Using the Failure Distance Concept
Continuous-time Markov chains are commonly used for dependability modeling of repairable fault-tolerant computer systems. Realistic models of non-trivial fault-tolerant systems often have very large state spaces. An attractive approach for dealing with the largeness problem is the use of pruning methods with error bounds. Several such methods for computing steady-state availability bounds have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998